Deriving cryptographic keys from physiological signals

Biosensors aim at providing pervasive healthcare by collecting and communicating highly sensitive medical information. Due to their extreme limitations, lightweight and secure key management infrastructures are required. For this reason, biosensors use physiological parameters that are generated from different vital signals (i.e., electrocardiogram, photoplethysmogram, blood pressure) to protect the exchanged private health information. In this paper, we define two novel physiological parameter generation techniques and analyze both the performance and the quality of the outcomes. Our results show that we generate good candidates of physiological parameters that can be used as cryptographic keys to secure the communication among the biosensors.     

CMAC, CCM and GCM/GMAC: Advanced modes of operation of symmetric block ciphers in wireless sensor networks

Symmetric block ciphers are usually used in WSN for security services. This paper puts forward the idea of using advanced modes of operation of symmetric block ciphers to achieve confidentiality and authentication in one cryptographic operation. The modes of operation approved by NIST that is CMAC, CCM, GCM/GMAC are applied here. The benchmarks of these approaches in the terms of efficiency of nodes in WSN are presented.     

Plateaued函数的正规性

Plateaued函数作为Bent函数和部分Bent函数的扩展,是一类能实现多个密码学准则折中的性质优良的密码函数。该文基于布尔函数与其分解函数的Walsh谱之间的关系研究了Plateaued函数的复杂性度量指标之一的正规性,根据其正规性质给出了判定给定Plateaued函数是否正规的一个较为简单的算法,并分析了已知Plateaued函数类的正规性。     

Plateaued函数的密码学性质

Plateaued函数是包含Bent函数和部分Bent函数的更大函数类,是一类密码学性质优良的密码函数,在非线性组合函数的设计中有重要的应用。该文以Walsh谱和自相关系数为工具,从密码函数的角度证明了r阶Plateaued函数的全体线性结构构成的子空间维数的上界为n-r,且等号成立当且仅当f(x)为部分Bent函数,同时还给出了Plateaued函数的其他一些密码学性质。     

密码技术中一种随机数检验方法的设计与实现

文章把线性复杂度理论检用于密码技术中,设计一种实用的序列随机性检验方法.该方法可以检测随机序列发生器产生序列的随机性,也可以用于检验密码算法的安全性.通过实验,发现该方法能更全面检验序列的随机特性.     

Abstraction and resolution modulo AC: How to verify Diffie–Hellman-like protocols automatically

We show how cryptographic protocols using Diffie–Hellman primitives, i.e., modular exponentiation on a fixed generator, can be encoded in Horn clauses modulo associativity and commutativity. In order to obtain a sufficient criterion of security, we design a complete (but not sound in general) resolution procedure for a class of flattened clauses modulo simple equational theories, including associativity–commutativity. We report on a practical implementation of this algorithm in the MOP modular platform for automated proving; in particular, we obtain the first fully automated proof of security of the IKA.1 initial key agreement protocol in the so-called pure eavesdropper model.     

一种用于密码协议形式化验证的简单逻辑

给出了一个可用于密码协议形式化验证与设计的简单逻辑.该逻辑采用抽象的通道概念表示具有多种安全特性的通信链路,可在比现有认证逻辑的更抽象的层次上对协议进行处理.     

Internet安全协议中的密钥交换技术研究

密钥创建是以密码学为基数的数据保护的核心,同时也是Internet上对报文进行保护的关键。介绍了在Internet协议中两个通信实体利用Diffie-Hellman密钥交换技术协商创建密钥的几种方案,并就每种方案的特点进行了讨论。     

Which new RSA-signatures can be computed from certain given RSA-signatures?

We consider the following problem. A signature authority issues RSA-signatures of certain types to an individual, and the individual tries, by using the signatures he received, to compute an RSA-signature of a type not issued by the authority. Is the individual able to do this? The RSA-signatures are products of rational powers of residue classes modulo the composite number N of the underlying RSA-system, and the residue classes are chosen at random by the signature authority. The rational exponents in the product determine the type of the signature. We prove that computing an RSA-signature of a particular type, from given RSA-signatures of other types, is polynomial time reducible to computing RSA-roots x ^1/d (mod N) for random x and some positive integer d. This extends results of Akl and Taylor [1] and Shamir [11] from one variable to arbitrarily many variables. As an application of this, under the assumption that for the individual it is infeasible to compute RSA-roots, we give necessary and sufficient conditions describing whether it is feasible for that individual to compute RSA-signatures of a prescribed type from signatures of other types that he received before from the authority.